Image = Structure + Few Colors

نویسندگان

چکیده

Topology plays an important role in computer vision by capturing the structure of objects. Nevertheless, its potential applications have not been sufficiently developed yet. In this paper, we combine topological properties image with hierarchical approaches to build a topology preserving irregular pyramid (TIIP). The TIIP algorithm uses combinatorial maps as data which implicitly capture terms critical points. Thus, can achieve compact representation image, and points (maxima, minima saddles). parallel algorithmic complexity building is \(O(\log d)\) where d diameter largest object. We promising results for reconstruction using only few color values although fine details including texture image.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coloring uniform hypergraphs with few colors

Let m(r, k) denote the minimum number of edges in an r-uniform hypergraph that is not k-colorable. We give a new lower bound on m(r, k) for fixed k and large r. Namely, we prove that if k 2, then m(r, k) (k)k(r/ln r) . © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 24: 1–10, 2004

متن کامل

Coloring graphs with locally few colors

Assume that a graph G has a good-coloring which uses at most r colors in the neighborhood of every vertex. We call this kind of coloring a local r-coloring . Is it true that the chromatic number of G is bounded? For r = 1 the answer is easy, G is bipartite, as it cannot have an odd circuit . For r = 2, however, the situation is completely different. A graph can be given with arbitrarily large (...

متن کامل

Injective colorings of planar graphs with few colors

An injective coloring of a graph is a vertex coloring where two vertices have distinct colors if a path of length two exists between them. In this paper some results on injective colorings of planar graphs with few colors are presented. We show that all planar graphs of girth ≥19 and maximum degree ∆ are injectively ∆-colorable. We also show that all planar graphs of girth ≥10 are injectively (...

متن کامل

Vertex Cover in Graphs with Locally Few Colors

In [13], Erdős et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are graphs with arbitrarily large chromatic number that can be colored so that (i) no vertex neighborhood contains more than ∆ different colors (bounded local colorability), and (ii) adjacent vertices from two color classes indu...

متن کامل

Image Retrieval using Fuzzy Representation of Colors

The problem addressed in this article is image indexing and retrieval according to the color. Indeed we propose a classification based on the dominant color(s) of the images. The process consists in two steps: first, assigning a colorimetric profile to the image in HLS space (Hue, Lightness, Saturation) and then, handling the query for the retrieval. To achieve the first step, the definition of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-73973-7_35